Percolation Problems on N-Ary Trees

On $n$-ary Hypergroups and Fuzzy $n$-ary Homomorphism

Accessibility percolation on n-trees

–Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in ascending order. For the case when the random variables are independent and identically distributed, we derive an asymptotically exact expression for the prob...

N-ary trees classifier

This paper addresses the problem of automatic detection and prediction of abnormal human behaviours in public spaces. For this propose a novel classifier, called N-ary trees, is presented. The classifier processes time series of attributes like the object position, velocity, perimeter and area, to infer the type of action performed. This innovative classifier can detect three types of events: n...

k-ary n-cubes versus Fat Trees

In this paper, we examine performance aspects of fat-tree topologies and compare these to k-ary ncube topologies. In particular, we apply the analytic techniques developed for cube topologies upon fat trees to understand better the characteristic of that topology. The organization of this paper is as follows: Section 1 contains an overview of k-ary n-cube and fat-tree topologies. Section 2 cont...

The Number of m-ary Search Trees on n Keys

24 Let h(x) := log 2 x x ?2 log(x + 1) expff(x)g = x log 2 ? 2 log x + log log(x + 1) + f(x); it suuces to show that h(x) > 0 for x 5. Now h(5) : = 0:20 > 0 and h 0 (x) = log 2 ? 2x ?1 + 1 (x + 1) log(x + 1) + (x ? 1) ?2 log x > 1 (x + 1) log(x + 1) + (x ? 1) ?2 log x > 0 for x 5. Thus h(x) > 0 for x 5. This follows from calculus, since the last expression is strictly increasing in real m > 1.